Universal codes for finite sequences of integers drawn from a monotone distribution

Common Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms

In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...

Universal Codes for Finite Sequen es of IntegersDrawn from a Monotone

Non-Abelian Sequenceable Groups Involving ?-Covers

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

Robust Universal Complete

Several measures are deened and investigated, which allow the comparison of codes as to their robustness against errors. Then new universal and complete sequences of variable-length codewords are proposed , based on representing the integers in a binary Fibonacci numer-ation system. Each sequence is constant and need not be generated for every probability distribution. These codes can be used a...

Optimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem

  In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...